Fast computation of 3D radon transform via a direct Fourier method
نویسندگان
چکیده
منابع مشابه
Fast computation of 3D radon transform via a direct Fourier method
MOTIVATION Arrays of three-dimensional (3D) data are ubiquitous in structural biology, biomedicine and clinical imaging. The Radon transform can be implied in their manipulation mainly for the solution of the inverse tomographic problem, since experimental data are often collected as projections or as samples of the Radon space. In electron tomography, new applications of the transform may beco...
متن کامل3D Fourier based discrete Radon transform
The Radon transform is a fundamental tool in many areas. For example, in reconstruction of an image from its projections (CT scanning). Recently A. Averbuch et al. [SIAM J. Sci. Comput., submitted for publication] developed a coherent discrete definition of the 2D discrete Radon transform for 2D discrete images. The definition in [SIAM J. Sci. Comput., submitted for publication] is shown to be ...
متن کاملFast 3D Hough Transform Computation
We present a three-dimensional generalization of linear Hough transform allowing fast calculating of sums along all planes in discretized space. The main idea of this method is multiple calculation of two-dimensional fast Hough transforms combined with a specific method for plane parametrization. Compared to the direct summation, the method achieves significant acceleration ( O(n log n) vs O(n)...
متن کاملFast Approximate Fourier Transform via Wavelets Transform
We propose an algorithm that uses the discrete wavelet transform (DWT) as a tool to compute the discrete Fourier transform (DFT). The Cooley-Tukey FFT is shown to be a special case of the proposed algorithm when the wavelets in use are trivial. If no intermediate coeecients are dropped and no approximations are made, the proposed algorithm computes the exact result, and its computational comple...
متن کاملA Method for Fast Computation of the Fourier Transform over a Finite Field
—We consider the problem of fast computation of the Fourier transform over a finite field by decomposing an arbitrary polynomial into a sum of linearized polynomials. Examples of algorithms for the Fourier transform with complexity less than that of the best known analogs are given.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 1998
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/14.2.212